CS 787 : Advanced Algorithms Linear Programming
نویسنده
چکیده
Instructor: Dieter van Melkebeek This lecture covers the notion of a linear program, its dual, and the relationship between the two. We give some examples and survey known algorithms. A linear program (LP) is the problem of optimizing (maximizing or minimizing) a linear multivariate objective function over the reals under linear equality and inequality (≤) constraints.
منابع مشابه
CS 787 : Advanced Algorithms Flows and Cuts
This lecture covers the construction of optimal flows and cuts in networks, their relationship, and some applications. It paves the way to our subsequent treatment of linear programming. The network flow and cut algorithms do not follow any of the paradigms we discussed so far, not do they represent a paradigm of their own. The applications we will present illustrate the paradigm of efficient r...
متن کاملCS 787 : Advanced Algorithms LP - Based Approximations
We present methods for constructing approximation algorithms to NP-hard optimization problems using linear programming (LP). We typically obtain an LP relaxation of the problem by formulating it as an integer linear program and dropping the integrality constraints. We then solve the LP relaxation exactly, and apply various rounding strategies (including randomized rounding and iterative roundin...
متن کاملCS 787 : Advanced Algorithms Scribe :
In this course we will study techniques for designing and analyzing algorithms. Undergraduate algorithms courses typically cover techniques for designing exact, efficient (polynomial time) algorithms. The focus of this course is different. We will consider problems for which polynomial time exact algorithms are not known, problems under stringent resource constraints, as well as problems for wh...
متن کاملThe project portfolio selection and scheduling problem: mathematical model and algorithms
This paper investigates the problem of selecting and scheduling a set of projects among available projects. Each project consists of several tasks and to perform each one some resource is required. The objective is to maximize total benefit. The paper constructs a mathematical formulation in form of mixed integer linear programming model. Three effective metaheuristics in form of the imperialis...
متن کامل